Algebras for Parameterised Monads
نویسنده
چکیده
Parameterised monads have the same relationship to adjunctions with parameters as monads do to adjunctions. In this paper, we investigate algebras for parameterised monads. We identify the EilenbergMoore category of algebras for parameterised monads and prove a generalisation of Beck’s theorem characterising this category. We demonstrate an application of this theory to the semantics of type and effect systems.
منابع مشابه
Parameterised Notions of Computation
Moggi’s Computational Monads and Power et al ’s equivalent notion of Freyd category have captured a large range of computational effects present in programming languages. Examples include non-termination, non-determinism, exceptions, continuations, side-effects and input/output. We present generalisations of both computational monads and Freyd categories, which we call parameterised monads and ...
متن کاملOperads as Polynomial 2-monads
In this article we give a construction of a polynomial 2-monad from an operad and describe the algebras of the 2-monads which then arise. This construction is different from the standard construction of a monad from an operad in that the algebras of our associated 2-monad are the categorified algebras of the original operad. Moreover it enables us to characterise operads as categorical polynomi...
متن کاملComplete Elgot Monads and Coalgebraic Resumptions
Monads are extensively used nowadays to abstractly model a wide range of computational effects such as nondeterminism, statefulness, and exceptions. It turns out that equipping a monad with a (uniform) iteration operator satisfying a set of natural axioms allows for modelling iterative computations just as abstractly. The emerging monads are called complete Elgot monads. It has been shown recen...
متن کاملCorecursive Algebras, Corecursive Monads and Bloom Monads
An algebra is called corecursive if from every coalgebra a unique coalgebra-toalgebra homomorphism exists into it. We prove that free corecursive algebras are obtained as coproducts of the terminal coalgebra (considered as an algebra) and free algebras. The monad of free corecursive algebras is proved to be the free corecursive monad, where the concept of corecursive monad is a generalization o...
متن کاملPartially Ordered Monads for Monadic Topologies, Rough Sets and Kleene Algebras
In this paper we will show that partially ordered monads contain sufficient structure for modelling monadic topologies, rough sets and Kleene algebras. Convergence represented by extension structures over partially ordered monads includes notions of regularity and compactness. A compactification theory can be developed. Rough sets [23] are modelled in a generalized setting with set functors. Fu...
متن کامل